does simple binary crossover hasten rcga convergence?

real coded genetic algorithm, rcga, is the type of ga which operates on chromosomes with real valued parameters. different mutation and crossover operations are defined for rcga. one usable crossover for this kind of ga is to consider its chromosomes simply as bit strings and utilize the same operations as binary coded ga. in this paper, we attempt to show that this kind of crossover can not hasten the convergence process unless the break points fall at the boundaries of parameters in the chromosome.